A Note on Hardness of Computing Recursive Teaching Dimension
نویسندگان
چکیده
In this short note, we show that the problem of computing recursive teaching dimension (RTD) for a concept class (given explicitly as input) requires nΩ(logn)-time, assuming exponential time hypothesis (ETH). This matches running nO(logn) brute-force algorithm problem.
منابع مشابه
On the Recursive Teaching Dimension of VC Classes
The recursive teaching dimension (RTD) of a concept class C ⊆ {0, 1}, introduced by Zilles et al. [ZLHZ11], is a complexity parameter measured by the worst-case number of labeled examples needed to learn any target concept of C in the recursive teaching model. In this paper, we study the quantitative relation between RTD and the well-known learning complexity measure VC dimension (VCD), and imp...
متن کاملOpen Problem: Recursive Teaching Dimension Versus VC Dimension
The Recursive Teaching Dimension (RTD) of a concept class C is a complexity parameter referring to the worst-case number of labelled examples needed to learn any target concept in C from a teacher following the recursive teaching model. It is the first teaching complexity notion for which interesting relationships to the VC dimension (VCD) have been established. In particular, for finite maximu...
متن کاملRecursive teaching dimension, VC-dimension and sample compression
This paper is concerned with various combinatorial parameters of classes that can be learned from a small set of examples. We show that the recursive teaching dimension, recently introduced by Zilles et al. (2008), is strongly connected to known complexity notions in machine learning, e.g., the self-directed learning complexity and the VC-dimension. To the best of our knowledge these are the fi...
متن کاملA note on hardness of diameter approximation
We revisit the hardness of approximating the diameter of a network. In the CONGEST model of distributed computing, Ω̃(n) rounds are necessary to compute the diameter [Frischknecht et al. SODA’12], where Ω̃(⋅) hides polylogarithmic factors. Abboud et al. [DISC 2016] extended this result to sparse graphs and, at a more ne-grained level, showed that, for any integer 1 ≤ ` ≤ polylog(n), distinguishin...
متن کاملA note on recursive optimization
This paper presents a new and efficient approach for optimization and implementation of filter banks e.g. velocity channels, orientation channels and scale spaces. The multi layered structure of a filter network enable a powerful decomposition of complex filters into simple filter components and the intermediary results may contribute to several output nodes. Compared to a direct implementation...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Processing Letters
سال: 2024
ISSN: ['1872-6119', '0020-0190']
DOI: https://doi.org/10.1016/j.ipl.2023.106429